Applying Local Search to Structural Constraint Satisfaction

Alexander Nareyek GMD | FIRST German National Research Center for Information Technology Research Institute for Computer Architecture and Software Technology Rudower Chaussee 5 D 12489 Berlin, Germany [email protected] Abstract Although domains like a continuous workow planning are promising application candidates for constraint programming techniques, conventional constraint satisfaction representations and algorithms are not expressive and reactive enough. Thus, the present work extends and combines the concept of structural constraint satisfaction problems with the use of local search and global constraints.